Component (edge) connectivity of pancake graphs
نویسندگان
چکیده
The l-component (edge) connectivity of a graph G, denoted by cκl(G) (cλl(G)), is the minimum number vertices (edges) whose removal from G results in disconnected with at least l components. pancake Pn popular underlying topology for distributed systems. In paper, we determine cκl(Pn) and cλl(Pn) 3 ≤ 5.
منابع مشابه
On the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملThe Spanning Connectivity of the Burnt Pancake Graphs
Let u and v be any two distinct vertices of an undirected graph G, which is k-connected. For 1 ≤ w ≤ k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A wcontainer C(u, v) of G is a w∗-container if it contains all the vertices of G. A graph G is w∗-connected if there exists a w∗-container between any two distinct vertices. Let κ(G) be the connectivi...
متن کاملEdge-connectivity and super edge-connectivity of P2-path graphs
For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...
متن کاملThe super connectivity of the pancake graphs and the super laceability of the star graphs
A k-container C(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k∗-container if it contains all the vertices of G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let (G) be the connectivity of G. A graph G is super connected if G is i∗-connected for all 1 i (G). A bipartite graph G is k∗-laceable if the...
متن کاملEdge-connectivity of strong products of graphs
The strong product G1 £G2 of graphs G1 and G2 is the graph with V (G1) × V (G2) as the vertex set, and two distinct vertices (x1, x2) and (y1, y2) are adjacent whenever for each i ∈ {1, 2} either xi = yi or xiyi ∈ E(Gi). In this note we show that for two connected graphs G1 and G2 the edge-connectivity λ(G1£G2) equals min{δ(G1£ G2), λ(G1)(|V (G2)|+2|E(G2)|), λ(G2)(|V (G1)|+2|E(G1)|)}. In additi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2023
ISSN: ['1855-3974', '1855-3966']
DOI: https://doi.org/10.26493/1855-3974.2913.35e